Symbolic substitution basedcanonical recoding algorithms
نویسندگان
چکیده
منابع مشابه
Exponent Recoding and Regular Exponentiation Algorithms
This paper describes methods of recoding exponents to allow for regular implementations of m-ary exponentiation algorithms. Recoding algorithms previously proposed in the literature do not lend themselves to being implemented in a regular manner, which is required if the implementation needs to resist side-channel attacks based on simple power analysis. The advantage of the algorithms proposed ...
متن کاملNew Symbolic Substitution Algorithms for Optical Arithmetic using Signed -Digit Representation
In this paper, we present a new approach to designing optical digital arithmetic systems. We present new arithmetic algorithms based on a modified signed -digit number representation. New Signed -digit symbolic substitution rules are introduced to implement them. These signed -digit arithmetic algorithms are well suited for optical implementation because, of the confined carry propagation withi...
متن کاملA New Symbolic Substitution Based Addition Algorithm
Symbolic substitution, a parallel processing technique, has been proposed in computing literature to perform fast, carry-free addition of numbers. Several algorithms and corresponding symbolic substitution tables have been developed for addition of two numbers represented in binary, modified signed digit (MSD), and canonical modified signed digit (CMSD) number systems. In this paper, however, w...
متن کاملAlgorithms for Symbolic Polynomials
•Computer algebra systems have a hard time working with symbolic values, e.g. –Polynomials of degree d –Elements of a field of characterisic p –Matrices of dimension n × n when d, p and n are not given. •We are interested in expanding the range of problems computer algebra systems can handle, beginning with algorithms for polynomials of symbolic degree. •+, ×, ∂ are straightforward. •What about...
متن کاملBilateral Algorithms for Symbolic Abstraction
Given a concrete domain C, a concrete operation τ : C → C, and an abstract domain A, a fundamental problem in abstract interpretation is to find the best abstract transformer τ : A → A that overapproximates τ . This problem, as well as several other operations needed by an abstract interpreter, can be reduced to the problem of symbolic abstraction: the symbolic abstraction of a formula φ in log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2004
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2004.05.008